Unsupervised Relation Disambiguation with Order Identification Capabilities
نویسندگان
چکیده
We present an unsupervised learning approach to disambiguate various relations between name entities by use of various lexical and syntactic features from the contexts. It works by calculating eigenvectors of an adjacency graph’s Laplacian to recover a submanifold of data from a high dimensionality space and then performing cluster number estimation on the eigenvectors. This method can address two difficulties encoutered in Hasegawa et al. (2004)’s hierarchical clustering: no consideration of manifold structure in data, and requirement to provide cluster number by users. Experiment results on ACE corpora show that this spectral clustering based approach outperforms Hasegawa et al. (2004)’s hierarchical clustering method and a plain k-means clustering method.
منابع مشابه
Error Driven Word Sense Disambiguation
In this paper we describe a method for performing word sense disambiguation (WSD). The method relies on unsupervised learning and exploits functional relations among words as produced by a shallow parser. By exploiting an error driven rule learning algorithm (Brill 1997), the system is able to produce rules for WSD, which can be optionally edited by humans in order to increase the performance o...
متن کاملExperiments in Automatic Word Class and Word Sense Identification for Information Retrieval
Automatic identification of related words and automatic detection of word senses are two long-standing goals of researchers in natural language processing. Word class information and word sense identification may enhance the performance of information retrieval systems. Large online corpora and increased computational capabilities make new techniques based on corpus linguistics feasible. Corpus...
متن کاملUnsupervised Tag Sense Disambiguation in Folksonomies
Disambiguating tag senses can benefit many applications leveraging folksonomies as knowledge sources. In this paper, we propose an unsupervised tag sense disambiguation approach. For a target tag, we model all the annotations involving it with a 3-order tensor to fully explore the multi-type interrelated data. We perform spectral clustering over the hypergraph induced from the 3-order tensor to...
متن کاملUnsupervised Relation Disambiguation Using Spectral Clustering
This paper presents an unsupervised learning approach to disambiguate various relations between name entities by use of various lexical and syntactic features from the contexts. It works by calculating eigenvectors of an adjacency graph’s Laplacian to recover a submanifold of data from a high dimensionality space and then performing cluster number estimation on the eigenvectors. Experiment resu...
متن کاملFirst-order and second-order context representations: geometrical considerations and performance in word-sense disambiguation and discrimination
First-order and second-order context vectors (C and C) are two rival context representations used in word-sense disambiguation and other endeavours related to distributional semantics. C vectors record directly observable features of a context, whilst C vectors aggregate vectors themselves associated to the directly observable features of the context. Whilst C vectors may appeal on a number of ...
متن کامل